Learning from Pairwise Marginal Independencies
نویسندگان
چکیده
We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully explain a given set of independencies, and derive algorithms to efficiently enumerate such structures. Our results map out the space of faithful causal models for a given set of pairwise marginal independence relations. This allows us to show the extent to which causal inference is possible without using conditional independence tests.
منابع مشابه
Factorial Mixture of Gaussians and the Marginal Independence Model
Marginal independence constraints play an important role in learning with graphical models. One way of parameterizing a model of marginal independencies is by building a latent variable model where two independent observed variables have no common latent source. In sparse domains, however, it might be advantageous to model the marginal observed distribution directly, without explicitly includin...
متن کاملBinary models of marginal independence: a comparison of different approaches
Graphical models of marginal independence, introduced by Cox & Wermuth [1] with the name of covariance graph models, are also known in the literature as bidirected graph models following Richardson [6]. These models are of special interest because they belong to the families of ancestral and summary graphs; see Wermuth & Sadeghi [8] for a review. Let G = (V,E) be a bidirected graph defined by a...
متن کاملMarginal parameterizations of discrete models defined by a set of conditional independencies
It is well-known that a conditional independence statement for discrete variables is equivalent to constraining to zero a suitable set of log–linear interactions. In this paper we show that this is also equivalent to zero constraints on suitable sets of marginal log–linear interactions, that can be formulated within a class of smooth marginal log–linear models. This result allows much more flex...
متن کاملConstraint-based Causal Structure Learning when Faithfulness Fails
Constraint-based causal structure learning algorithms rely on the faithfulness property. For faithfulness, all conditional independencies should come from the system’s causal structure. The problem is that even for linear Gaussian models the property is not tenable. In this paper, we identify 4 non-causal properties that generate conditional independencies and investigate whether they can be re...
متن کاملCausal Inference on Data Containing Deterministic Relations
Data containing deterministic relations cannot be handled by current constraint-based causal learning algorithms; they entail conditional independencies that cannot be represented by a faithful graph. Violation of the faithfulness property is characterized by an information equivalence of two sets of variables with respect to a reference variable. The conditional independencies do not provide i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015